Polynomial-time counting and sampling of two-rowed contingency tables
نویسندگان
چکیده
منابع مشابه
Polynomial-time counting and sampling of two-rowed contingency tables
In this paper a Markov chain for contingency tables with two rows is defined. The chain is shown to be rapidly mixing using the path coupling method. We prove an upper bound for the mixing time of the chain. The upper bound is quadratic in the number of columns and linear in the logarithm of the table sum. By considering a specific problem, we prove a lower bound for the mixing time of the chai...
متن کاملPolynomial time perfect sampling algorithm for two-rowed contingency tables
This paper proposes a polynomial time perfect (exact) sampling algorithm for 2 × n contingency tables. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm. The expected running time is bounded by O(n lnN) where n is the number of columns and N is the total sum of all entries.
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Polynomial Time Perfect Sampling Algorithm for Two-rowed Contingency Tables
This paper proposes a polynomial time perfect (exact) sampling algorithm for 2×n contingency tables. Our algorithm is a Las Vegas type randomized algorithm and the expected running time is bounded by O(n ln N) where n is the number of columns and N is the total sum of whole entries in a table. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm and new Markov cha...
متن کاملA Genuinely Polynomial-time Algorithm for Sampling Two-rowed Contingency Tables (extended Abstract)
In this paper a Markov chain for contingency tables with two rows is deened. The chain is shown to be rapidly mixing using the path coupling method. The mixing time of the chain is quadratic in the number of columns and linear in the logarithm of the table sum. Two extensions of the new chain are discussed: one for three-rowed contingency tables and one for m-rowed contingency tables. We show t...
متن کاملSampling and Counting Contingency Tables Using Markov Chains
In this paper we present an overview of contingency tables, provide an introduction to the problems of almost uniform sampling and approximate counting, and show recent results achieved through the use of Markov chains. We focus specifically on contingency tables with two rows, since as of this time little progress has been made in achieving reasonable bounds on arbitrarily sized contingency ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00136-x